Isabelle/HOLCF — Higher-Order Logic of Computable Functions
ثبت نشده
چکیده
3 Cont: Continuity and monotonicity 18 3.1 Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3.2 Equivalence of alternate definition . . . . . . . . . . . . . . . 18 3.3 Collection of continuity rules . . . . . . . . . . . . . . . . . . 19 3.4 Continuity of basic functions . . . . . . . . . . . . . . . . . . 19 3.5 Finite chains and flat pcpos . . . . . . . . . . . . . . . . . . . 20
منابع مشابه
HOLCF: Higher Order Logic of Computable Functions
This paper presents a survey of HOLCF a higher order logic of computable functions The logic HOLCF is based on HOLC a variant of the well known higher order logic HOL which o ers the additional concept of type classes HOLCF extends HOLC with concepts of domain theory such as complete partial orders continuous functions and a xed point operator With the help of type classes the extension can be ...
متن کاملHolcf=hol+lcf
HOLCF is the de nitional extension of Church s Higher Order Logic with Scott s Logic for Computable Functions that has been implemented in the theorem prover Isabelle This results in a exible setup for reasoning about functional programs HOLCF supports stan dard domain theory in particular xpoint reasoning and recursive domain equations but also coinductive arguments about lazy datatypes This p...
متن کاملCertified HLints with Isabelle/HOLCF-Prelude
We present the HOLCF-Prelude, a formalization of a large part of Haskell’s standard prelude in Isabelle/HOLCF. Applying this formalization to the hints suggested by HLint allows us to certify them formally. In pure functional languages such as Haskell, equational reasoning is a valuable tool for refactoring, to improve both efficiency and aesthetics. For example, an experienced programmer would...
متن کاملHigher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a way that one may use any theory defined in Isabelle/HOLCF to construct assertions, e.g., primitive recursion, least or greatest fixed points etc. The higher-order logic ensures that we can show non-trivial algorithms ...
متن کاملRefinements in HOLCF: implementation of interactive systems
In this thesis re nement relations for the logic HOLCF are de ned We compare re ne ment relations de ned by theory interpretations and by model inclusion We use these re nements to implement abstract data types ADTs with LCF domains and continuous functions Therefore the implementation of ADTs may be applied to the implementation of interactive and distributed systems speci ed in HOLCF The impl...
متن کامل